Sublinear Algorithms for Approximating String Compressibility
نویسندگان
چکیده
منابع مشابه
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
We raise the question of approximating compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and Lempel-Ziv (LZ), and present algorithms and lower bounds for approximating compressibility with respect to both schemes. While we obtain much stronger results...
متن کاملSublinear Approximate String Matching
The present paper deals with the subject of approximate string matching and demonstrates how Chang and Lawler [CL94] conceived a new sublinear time algorithm out of ideas that had previously been known. The problem is to find all locations in a text of length n over a b-letter alphabet where a pattern of length m occurs with up to k differences (substitutions, insertions, deletions). The algori...
متن کاملApproximating PageRank locally with sublinear query complexity
The problem of approximating the PageRank score of a node with minimal information about the rest of the graph has attracted considerable attention in the last decade; but its central question, whether it is in general necessary to explore a non-vanishing fraction of the graph, remained open until now (only for specific graphs and/or nodes was a solution known). We present the first algorithm t...
متن کاملApproximating Semidefinite Programs in Sublinear Time
In recent years semidefinite optimization has become a tool of major importance in various optimization and machine learning problems. In many of these problems the amount of data in practice is so large that there is a constant need for faster algorithms. In this work we present the first sublinear time approximation algorithm for semidefinite programs which we believe may be useful for such p...
متن کاملA simpler sublinear algorithm for approximating the triangle count
A recent result of Eden, Levi, and Ron (ECCC 2015) provides a sublinear time algorithm to estimate the number of triangles in a graph. Given an undirected graph G, one can query the degree of a vertex, the existence of an edge between vertices, and the ith neighbor of a vertex. Suppose the graph has n vertices, m edges, and t triangles. In this model, Eden et al provided a O(poly(ε logn)(n/t+m/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9618-6